About Graph and Hypergraph Context Free Grammars
نویسنده
چکیده
The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent. Key-Words: Hyperedge Replacement Grammars, Graph Grammars, Chomsky, Greibach, Context Freeness, Nondeterministic, Deterministic
منابع مشابه
A Comparison of Boundary Graph Grammars and Context-Free Hypergraph Grammars
Context-free hypergraph grammars and boundary graph grammars of bounded nonterminal degree have the same power, both for generating sets of graphs and for generating sets of hypergraphs. Arbitrary boundary graph grammars have more graph generating power than context-free hypergraph grammars, but they have the same hypergraph generating power. To obtain these results, several normal forms for bo...
متن کاملSimilarities Between String Grammars and Graph Grammars
In this paper, we present some studies about relations existing between well known Chomsky string grammars and graph grammars, in particularly hypergraph grammars. We are discussing about deterministic context free Lindenmayer Systems used to describe commands to a device that generates black and white digital images. Instead of well-known methods of drawing, we will paint squares, not lines. A...
متن کاملHyperedge Replacement, Graph Grammars
In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge replacement, structural properties and decision problems, including the membersh...
متن کاملAttributed Context-Free Hypergraph Grammars
The concept of context-free hypergraph grammars (cfhg grammars) has been studied extensively over the past decade. In this paper we introduce attributed context-free hypergraph grammars (acfhg grammars) as an extension of cfhg grammars. An acfhg grammar consists of an underlying context-free hypergraph grammar G 0 and an attribution which associates attributes with the nonterminal symbols of G ...
متن کاملConstructing a Bidirectional Transformation between BPMN and BPEL with Functional-logic Graph Parser Combinators
The abstract syntax of structured Business Process Models (BPMs) can be described by a context-free hypergraph grammar in a straightforward way. Functional-logic graph parser combinators can be used to construct powerful parsers for such context-free hypergraph grammars. These parsers can be enriched with semantic computations, e.g. to synthesize BPEL from BPMN. Moreover, they are bidirectional...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011